Simulated annealing
نویسنده
چکیده
Metaheuristics are general problem solving algorithms which abstract from the actual problem description. Therefore they can be easily applied to many optimization problems. Simulated annealing is a simple and fast metaheuristic with an analogy to metal processing. As metal particles generate a solid and regular structure when cooling slowing simulated annealing seeks a low-energy solution avoiding local optima. 1 NP-complete problems in computer science Since Stephen Cook’s paper The complexity of theorem proving procedures from 1971 computer scientists know about a special class of problems which are very difficult to solve. These problems were later called NP-complete problems. Richard Karp showed in 1972 that there are some very important and often needed problems among them, such as the 0-1 integer programming problem. Many problems in the area of business studies and operations research can be reduced to a combinatorial optimization problem and then be solved by an integer programming algorithm. Capacity planning is such a problem. Imagine a big car company which has several production sites all over the world. A car typically consists of about 10000 components. The difficulty is to decide which component to produce at which site. It might be cheap to produce components in countries which are rich in raw materials or countries having low unit labor costs but some production processes might only be feasible in industrialized nations. Furthermore the finished cars need to be transported to the countries where they can be sold. By minimizing expenses and maximizing profits good solutions can be found. Such a problem can be expressed mathematically by a set of integer inequalities. This mathematical representation, also called a constraint optimization problem, is a combinatorial optimization problem and can be solved by linear integer programming, which is a generalization of 0-1 integer programming. Thus the capacity planning problem is NP-complete. Unfortunately NP-complete problems can’t be solved efficiently so far and they will most likely never be solved efficiently. In this context efficiently denotes polynomial computation complexity.
منابع مشابه
به کارگیری الگوریتم SA ( Simulated Annealing ) برای تعویض پیش گیرانه بهینه قطعات به منظور حداقل کردن زمان خوابیدگی
این مقاله الگوریتم SA ( Simulated Annealing ) را بعنوان یک الگوریتم ابتکاری و هوشمند جهت برنامه ریزی بهتر تعویض قطعات به منظور حداقل کردن زمان خوابیدگی مورد بررسی قرار می دهد نتایج حاصل از الگوریتم با روش متداول مقایسه شده و عملکرد آن را در قالب کیفیت جواب و سرعت محاسبات نشان می دهد
متن کاملMulti-start simulated annealing for dynamic plant layout problem
In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کامل